TripNet: A Method for Constructing Phylogenetic Networks from Triplets

نویسندگان

  • Ruzbeh Tusserkani
  • Changiz Eslahchi
  • Hadi Poormohammadi
  • Azin Azadi
چکیده

Ruzbeh Tusserkani∗, Changiz Eslahchi†, Hadi Pourmohammadi†, and Azin Azadi‡ ⋆ ∗ School of Mathematics, Institute for Research in Fundamental Sciences (IPM). P.O. Box 193955746, Tehran, Iran ; † Department of Mathematics, Shahid Beheshti University, G.C. Tehran, Iran; ‡ Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran; and ⋆ School of Computer Science, Institute for reaserch in Fundamental Sciences (IPM), Tehran, Iran.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets

The problem of constructing an optimal rooted phylogenetic network from an arbitrary set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet, which tries to construct a rooted phylogenetic network with the minimum number of reticulation nodes from an arbitrary set of rooted triplets. Despite of current methods that work for dense set of roote...

متن کامل

TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets

The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet which tries to construct an optimal rooted phylogenetic network from an arbitrary set of triplets. We prove some theorems to justify the performance of the algorithm.

متن کامل

Constructing Rooted Phylogenetic Networks from Triplets based on Height Function

The problem of constructing an optimal rooted phylogenetic‎ ‎network from a set of rooted triplets is NP-hard. ‎In this paper‎, ‎we present a novel method called NCH‎, ‎which tries to construct a rooted phylogenetic network with the minimum number‎‎of reticulation nodes from an arbitrary set of rooted triplets based on the concept of the height function of a tree and a network. We report the pe...

متن کامل

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks

Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal gene transfer. The level k of a network determines how non-treelike the evolution can be, with level-0 networks being trees. We study the problem of constructing level-k phylogenetic networks from tri...

متن کامل

How Much Information is Needed to Infer Reticulate Evolutionary Histories?

Phylogenetic networks are a generalization of evolutionary trees and are an important tool for analyzing reticulate evolutionary histories. Recently, there has been great interest in developing new methods to construct rooted phylogenetic networks, that is, networks whose internal vertices correspond to hypothetical ancestors, whose leaves correspond to sampled taxa, and in which vertices with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1104.4720  شماره 

صفحات  -

تاریخ انتشار 2011